Model Counting for Formulas of Bounded Clique-Width
نویسندگان
چکیده
We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular treewidth, which were the most general results of this kind known so far.
منابع مشابه
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the graphs of every class that is nicely locally clique-width-decomposable. This notion generalizes that of a nicely locally tree-decomposable class. The graphs of s...
متن کاملBetter Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known – e.g. [Fischer, Makowsky, and Ravve] – with a singleexponential dependency on the clique-width of a formula. Our algorithm thus presents an exponential runtime improvement (...
متن کاملGraphs of Bounded Rank-width
We define rank-width of graphs to investigate clique-width. Rank-width is a complexity measure of decomposing a graph in a kind of tree-structure, called a rankdecomposition. We show that graphs have bounded rank-width if and only if they have bounded clique-width. It is unknown how to recognize graphs of clique-width at most k for fixed k > 3 in polynomial time. However, we find an algorithm r...
متن کاملCounting truth assignments of formulas of bounded tree-width or clique-width
We study algorithms for ]SAT and its generalized version ]GENSAT, the problem of computing the number of satisfying assignments of a set of propositional clauses . For this purpose we consider the clauses given by their incidence graph, a signed bipartite graph SI( ), and its derived graphs I( ) and P ( ). It is well known, that, given a graph of tree-width k, a k-tree decomposition can be foun...
متن کاملOn the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is deenable in Monadic Second Order Logic. We show that for bounded tree-width these problems are solvable in polynomial time. The same holds for bounded clique width in the cases, where the decomposition , which establishes the bound on the clique{width, can be computed in polynomia...
متن کامل